FSAI-based parallel Mixed Constraint Preconditioners for saddle point problems arising in geomechanics

نویسندگان

  • Luca Bergamaschi
  • Angeles Martinez
چکیده

In this paper we propose and describe a parallel implementation of a block preconditioner for the solution of saddle point linear systems arising from Finite Element (FE) discretization of 3D coupled consolidationproblems. TheMixedConstraint Preconditioner developed in [L. Bergamaschi,M. Ferronato, G. Gambolati,Mixed constraint preconditioners for the solution to FE coupled consolidation equations, J. Comput. Phys., 227(23) (2008), 9885–9897] is combined with the parallel FSAI preconditioner which is used here to approximate the inverses of both the structural (1, 1) block and an appropriate Schur complement matrix. The resulting preconditioner proves effective in the acceleration of the BiCGSTAB iterative solver. Numerical results on a number of test cases of size up to 2 × 106 unknowns and 1.2 × 108 nonzeros show the perfect scalability of the overall code up to 256 processors. © 2011 Elsevier B.V. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Parallel Inexact Constraint Preconditioners for Saddle Point Problems

In this paper we propose a parallel implementation of the FSAI preconditioner to accelerate the PCG method in the solution of symmetric positive definite linear systems of very large size. This preconditioner is used as building block for the construction of an indefinite Inexact Constraint Preconditioner (ICP) for saddle point-type linear systems arising from Finite Element (FE) discretization...

متن کامل

Parallel Rayleigh Quotient Optimization with FSAI-Based Preconditioning

The present paper describes a parallel preconditioned algorithm for the solution of partial eigenvalue problems for large sparse symmetric matrices, on parallel computers. Namely, we consider the Deflation-Accelerated Conjugate Gradient (DACG) algorithm accelerated by factorized sparse approximate inverse (FSAI) type preconditioners. We present an enhanced parallel implementation of the FSAI pr...

متن کامل

Probing Methods for Saddle-point Problems

Abstract. Several Schur complement-based preconditioners have been proposed for solving (generalized) saddle-point problems. We consider matrices where the Schur complement has rapid decay over some graph known a priori. This occurs for many matrices arising from the discretization of systems of partial differential equations, and this graph is then related to the mesh. We propose the use of pr...

متن کامل

An Implicit Approximate Inverse Preconditioner for Saddle Point Problems

We present a preconditioner for saddle point problems which is based on an approximation of an implicit representation of the inverse of the saddle point matrix. Whereas this preconditioner does not require an approximation to the Schur complement, its theoretical analysis yields some interesting relationship to some Schurcomplement-based preconditioners. Whereas the evaluation of this new prec...

متن کامل

Substructure Preconditioners for Elliptic Saddle Point Problems

Domain decomposition preconditioners for the linear systems arising from mixed finite element discretizations of second-order elliptic boundary value problems are proposed. The preconditioners are based on subproblems with either Neumann or Dirichlet boundary conditions on the interior boundary. The preconditioned systems have the same structure as the nonpreconditioned systems. In particular, ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Computational Applied Mathematics

دوره 236  شماره 

صفحات  -

تاریخ انتشار 2011